//
// Created by admin on 2022/6/13.
// 162. 寻找峰值: https://leetcode.cn/problems/find-peak-element/
//
#include <vector>
#include <algorithm>

using namespace std;

class FindPeakElement {
public:
    int findPeakElement(vector<int>& nums) {
        int l = 0, r = nums.size() - 1;
        while( l < r) {
            int mid = ( l + r )/2;
            if(nums[mid] > nums[mid + 1]){
                r = mid;
            }  else {
               l = mid + 1;
            }
        }
        return r;
    }
};
